On Transfer Operators for Continued Fractions with Restricted Digits
نویسندگان
چکیده
For I ⊂ N, let ΛI denote those numbers in the unit interval whose continued fraction digits all lie in I. Define the corresponding transfer operator LI,βf(z) = ∑ n∈I ( 1 n+z )2β f ( 1 n+z ) for Re(β) > max(0, θI), where Re(β) = θI is the abscissa of convergence of the series ∑ n∈I n −2β . When acting on a certain Hilbert space HI,β , we show that the operator LI,β is conjugate to an integral operator KI,β . If furthermore β is real, then KI,β is selfadjoint, so that LI,β : HI,β → HI,β has purely real spectrum. It is proved that LI,β also has purely real spectrum when acting on various Hilbert or Banach spaces of holomorphic functions, on the nuclear space C[0, 1], and on the Fréchet space C∞[0, 1]. The analytic properties of the map β 7→ LI,β are investigated. For certain alphabets I of an arithmetic nature (eg. I = {primes}, I = {squares}, I an arithmetic progression, I the set of sums of two squares) it is shown that β 7→ LI,β admits an analytic continuation beyond the half-plane Re(β) > θI .
منابع مشابه
Rigorous Effective Bounds on the Hausdorff Dimension of Continued Fraction Cantor Sets: a Hundred Decimal Digits for the Dimension of E2
We prove that the algorithm of [13] for approximating the Hausdorff dimension of dynamically defined Cantor sets, using periodic points of the underlying dynamical system, can be used to establish completely rigorous high accuracy bounds on the dimension. The effectiveness of these rigorous estimates is illustrated for Cantor sets consisting of continued fraction expansions with restricted digi...
متن کاملContinued Fraction Algorithms, Functional Operators, and Structure Constants Continued Fraction Algorithms, Functional Operators, and Structure Constants 1 Continued Fraction Algorithms, Functional Operators, and Structure Constants
Continued fractions lie at the heart of a number of classical algorithms like Euclid's greatest common divisor algorithm or the lattice reduction algorithm of Gauss that constitutes a 2-dimensional generalization. This paper surveys the main properties of functional operators, |transfer operators| due to Ruelle and Mayer (also following L evy, Kuzmin, Wirsing, Hensley, and others) that describe...
متن کاملContinued Fraction Algorithms, Functional Operators, and Structure Constants
Continued fractions lie at the heart of a number of classical algorithms like Euclid's greatest common divisor algorithm or the lattice reduction algorithm of Gauss that constitutes a 2-dimensional generalization. This paper surveys the main properties of functional operators, |transfer operators| due to Ruelle and Mayer (also following L evy, Kuzmin, Wirs-ing, Hensley, and others) that describ...
متن کاملContinued Fractions , Comparison Algorithms , and Fine
There are known algorithms based on continued fractions for comparing fractions and for determining the sign of 2x2 determinants. The analysis of such extremely simple algorithms leads to an incursion into a surprising variety of domains. We take the reader through a light tour of dynamical systems (symbolic dynamics), number theory (continued fractions), special functions (multiple zeta values...
متن کاملDesign and Synthesis of High Speed Low Power Signed Digit Adders
Signed digit (SD) number systems provide the possibility of constant-time addition, where inter-digit carry propagation is eliminated. Such carry-free addition is primarily a three-step process; adding the equally weighted SDs to form the primary sum digits, decomposing the latter to interim sum digits and transfer digits, which commonly belong to {–1, 0, 1}, and finally adding the tra...
متن کامل